Recursive or iterative routing? Hybrid!
نویسنده
چکیده
In our current work with the Chord protocol [SMK01] we had to decide whether to use iterative or recursive routing. Iterative routing provides the initiating node with a lot of information and influence on the routing path. Recursive routing on the other hand is faster and results in less overhead, most notably in stable networks. We present a hybrid routing solution that inherits the advantages of both approaches without increasing the overhead or slowing down the lookup procedure.
منابع مشابه
Hybrid Routing for FPGAs by Integrating Boolean Satisfiability with Geometric Search
Boolean Satisfiability (SAT)-based routing has unique advantages over conventional one-net-at-a-time approaches such as simultaneous net embedding or routability decision. Yet SAT-based routing has been criticized for scalability issues. On the other hand, geometric search routing algorithms, even with extensive rip-up-reroute capabilities, have difficulty achieving routing solution convergence...
متن کاملAn hybrid explicit multicast/recursive unicast approach for multicast routing
In this paper, we propose a new approach, Simple Explicit Multicast (SEM), which uses an efficient method to construct multicast trees and to deliver multicast packets to all destinations. In order to construct a multicast tree, the source encodes the list of destination addresses in a branch message. This message discovers the tree branching routers and creates a multicast routing state in eac...
متن کاملA Vehicle Routing Problem with Inventory in a Hybrid Uncertain Environment
Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...
متن کاملRecursion based parallelization of exact dense linear algebra routines for Gaussian elimination
We present block algorithms and their implementation for the parallelization of sub-cubic Gaussian elimination on shared memory architectures. Contrarily to the classical cubic algorithms in parallel numerical linear algebra, we focus here on recursive algorithms and coarse grain parallelization. Indeed, sub-cubic matrix arithmetic can only be achieved through recursive algorithms making coarse...
متن کاملA Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains
Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...
متن کامل